منابع مشابه
Pseudo-Boolean optimization
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced)...
متن کاملOptimization Over Pseudo-Boolean Lattices
In this paper, first we will find the solution of the system A ∗ X ≤ b, where A, b are the known suitable matrices and X is the unknown matrix over a pseudoBoolean lattice. Then its application to find the solution of some fuzzy linear systems as well as finding the solution of the optimization problem Z = max{C∗X|A∗ X ≤ b} is discussed. Key-words: pseudo-Boolean lattice, linear programming, fu...
متن کاملEfficient Haplotype Inference with Pseudo-boolean Optimization
Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible using existing technology. One of the methods for solving this problem uses the pure parsimony criterion, an approach known as Haplotype Inference by Pure Parsimony (HIPP). Initial work in this area was based on a number of dif...
متن کاملNonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we inves...
متن کاملSubmodularization for Quadratic Pseudo-Boolean Optimization
Many computer vision problems require optimization of binary non-submodular energies. We propose a general optimization framework based on local submodular approximations (LSA). Unlike standard LP relaxation methods that linearize the whole energy globally, our approach iteratively approximates the energies locally. On the other hand, unlike standard local optimization methods (e.g. gradient de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00341-9